Implementing Luby's Algorithm on the Cray T3E

نویسنده

  • Markus Lohrey
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implementing The Generalised Hybrid Monte-Carlo Algorithm

UKQCD’s dynamical fermion project uses the Generalised Hybrid Monte Carlo (GHMC) algorithm to generate QCD gauge configurations for a non-perturbatively O(a) improved Wilson action with two degenerate sea-quark flavours. We describe our implementation of the algorithm on the Cray-T3E, concentrating on issues arising from code verification and performance optimisation, such as parameter tuning, ...

متن کامل

Network Simulation on Cray-T3E using MPI

We propose a novel approach for parallel discrete-event network simulation on packet-switched, point-to-point networks. Our algorithm resolves packet connicts through priority sorting of appropriate integer connict functions. We implement our method on CM-5, Cray-T3D, and Cray-T3E systems using C and MPI, and perform critical optimizations aimed at reducing sorting overhead, minimizing inter-pr...

متن کامل

Parallel Distributed Fast 3d Poisson Solver

The fast Poisson solvers based on FFT computations are among the fastest techniques to solve Poisson problems on uniform grids. In this report, we present two parallel distributed implementations of a 3D fast Poisson solver in the context of the atmospheric simulation code Meso-NH 2]. The rst parallel implementation consists in implementing data movement between each computational step so that ...

متن کامل

Priority Queues and Sorting Methods for Parallel Simulation

We examine the design, implementation, and experimental analysis of parallel priority queues for device and network simulation. We consider: a) distributed splay trees using MPI, b) concurrent heaps using shared memory atomic locks, and c) a new, more general concurrent data structure based on distributed sorted lists, which is designed to provide dynamically balanced work allocation (with auto...

متن کامل

Lachesis: A Job Scheduler for the Cray T3E

This paper presents the design and implementation of Lach-esis, a job scheduler for the Cray T3E. Lachesis was developed at the San Diego Supercomputer Center (SDSC) in an attempt to correct some problems with the scheduling system Cray provides with the T3E.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007